A Strictly Finitistic System for Applied Mathematics
نویسنده
چکیده
This paper reports the technical work in the monograph Strict Finitism and the Logic of Mathematical Applications (available online). The monograph proposes a strictly nitistic system and then showes that some signi cant applied mathematics, including the basics of unbounded linear operators on Hilbert space, can be developed within that system. Potential philosophical implications or applications of the work are briey discussed.
منابع مشابه
A Recurrent Neural Network for Solving Strictly Convex Quadratic Programming Problems
In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...
متن کاملMaintenance Cost Analysis for Replacement Model with Perfect Minimal Repair
With the evolution of technology, the maintenance of sophisticated systems is of concern for system engineers and system designers. The maintenance cost of the system depends in general on the replacement and repair policies. The system replacement may be in a strictly periodic fashion or on a random basis depending upon the maintenance policy. At failure, the repair of the system may be perfor...
متن کاملA Quillen Model Structure Approach to the Finitistic Dimension Conjectures
We explore the interlacing between model category structures attained to classes of modules of finite X -dimension, for certain classes of modules X . As an application we give a model structure approach to the Finitistic Dimension Conjectures and present a new conceptual framework in which these conjectures can be studied. Let Λ be a finite dimensional algebra over a field k (or more generally...
متن کاملThe Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program
After a brief flirtation with logicism in 1917–1920, David Hilbert proposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays and Wilhelm Ackermann, throughout the 1920s. The two technical pillars of the project were the development of axiomatic systems for ever stronger and more comprehensive areas of mathematics and ...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008